Soundness and Completeness of Partial Deductions for Well-Founded Semantics
نویسندگان
چکیده
منابع مشابه
A Goal-Oriented Approach to Computing the Well-Founded Semantics
D Global SLS resolution is an ideal procedural semantics for the well-founded semantics. We present a more effective variant of global SLS resolution, called XOLDTNF resolution, which incorporates simple mechanisms for loop detection and handling. Termination is guaranteed for all programs with the bounded-term-size property. We establish the soundness and (search space) completeness of XOLDTNF...
متن کاملThe Semantics of Nominal Logic Programs
Nominal logic programming is a form of logic programming with “concrete” names and binding, based on nominal logic, a theory of alpha-equivalence founded on swapping and freshness constraints. Previous papers have employed different characterizations of the semantics of nominal logic programs, including operational, denotational, and prooftheoretic characterizations. In this paper we give a uni...
متن کاملA Game Semantics for System P (Extended Version)
In this paper we introduce a game semantics for System P, one of the most studied axiomatic systems for non-monotonic reasoning, conditional logic and belief revision. We prove soundness and completeness of the game semantics with respect to the rules of System P, and show that an inference is valid with respect to the game semantics if and only if it is valid with respect to the standard order...
متن کاملA Game Semantics for System P
In this paper we introduce a game semantics for System P, one of the most studied axiomatic systems for non-monotonic reasoning, conditional logic and belief revision. We prove soundness and completeness of the game semantics with respect to the rules of System P, and show that an inference is valid with respect to the game semantics if and only if it is valid with respect to the standard order...
متن کاملOperational Semantics for DyLPs
Theoretical research has spent some years facing the problem of how to represent and provide semantics to updates of logic programs. This problem is relevant for addressing highly dynamic domains with logic programming techniques. Two of the most recent results are the definition of the refined stable and the well founded semantics for dynamic logic programs that extend stable model and well fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992